منابع مشابه
Parallel Processing of Large Graphs
More and more large data collections are gathered worldwide in various IT systems. Many of them possess the networked nature and need to be processed and analysed as graph structures. Due to their size they require very often usage of parallel paradigm for efficient computation. Three parallel techniques have been compared in the paper: MapReduce, its map-side join extension and Bulk Synchronou...
متن کاملLarge-scale parallel processing systems
Parallel processing is an area of growing interest to the computer science and engineering communities. This paper is an introduction to some of the concepts involved in the design and use of large-scale parallel systems. Parallel machines that are classified as SIMD (synchronous) and MIMD (asynchronous) systems, composed of a large number of microprocessors, are explored. Parallel algorithms a...
متن کاملParallel Processing of Large Node B-Trees
SRT dividers with overlapped quotient selection stages, " in P m. Abstmct-This work investigates the performance improvement by parallel processing of large node B-trees. The main contribution of this paper is a node partitioning scheme for B-trees to enhance concurrency. In the proposed method, the tree height is reduced by increasing the node size. However, it is shown that increasing node si...
متن کاملDistributed Parallel Inference on Large Factor Graphs
As computer clusters become more common and the size of the problems encountered in the field of AI grows, there is an increasing demand for efficient parallel inference algorithms. We consider the problem of parallel inference on large factor graphs in the distributed memory setting of computer clusters. We develop a new efficient parallel inference algorithm, DBRSplash, which incorporates ove...
متن کاملSignal / Collect Processing Large Graphs in Seconds
Both researchers and industry are confronted with the need to process increasingly large amounts of data, much of which has a natural graph representation. Some use MapReduce for scalable processing, but this abstraction is not designed for graphs and has shortcomings when it comes to both iterative and asynchronous processing, which are particularly important for graph algorithms. This paper p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Future Generation Computer Systems
سال: 2014
ISSN: 0167-739X
DOI: 10.1016/j.future.2013.08.007